A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs
نویسندگان
چکیده
The subgraph isomorphism problem involves finding a pattern graph inside a target graph. We present a new bitand thread-parallel constraint-based search algorithm for the problem, and experiment on a wide range of standard benchmark instances to demonstrate its effectiveness. We introduce supplemental graphs, to create implied constraints. We use a new low-overhead, lazy variation of conflict directed backjumping which interacts safely with parallel search, and a counting-based all-different propagator which is better suited for large domains.
منابع مشابه
Solving Hard Subgraph Problems in Parallel
We look at problems involving finding subgraphs in larger graphs, such as the maximum clique problem, the subgraph isomorphism problem, and the maximum common subgraph problem. We investigate variable and value ordering heuristics, different inference strategies, intelligent backtracking search (backjumping), and bitand thread-parallelism to exploit modern hardware.
متن کاملParallelizing Subgraph Isomorphism Reenement for Classiication and Retrieval of Conceptual Structures 3 a Relation-based Representation For
abstract Major applications of graph-based knowledge representations will require quick response times on extremely large knowledge bases. Although algorithmic developments have provided tremendous improvements in speed, we believe implementation on parallel processors will be needed to meet long-term needs. This paper presents a new parallelization of a subgraph isomorphism reenement algorithm...
متن کاملP-subgraph Isomorphism Computation and Upper Bound Complexity Estimation
An approach for subgraph isomorphism computation of parameter-ized graphs will be presented. Parameterized graphs (short: p-graphs) are extensions of undirected graphs by parameter vectors at the nodes and edges. We will deene p-graphs and basic concepts of subgraph isomorphism computation for p-graphs. A bottom-up algorithm for p-subgraph isomorphism computation according to a given search gra...
متن کاملData Dependent Hardware for Subgraph Isomorphism Problem
Subgraph isomorphism problem has various important applications, while it is generally NP-complete and difficult to solve. Though Ullmann’s algorithm can be implemented by parallel hardware to accelerate the execution, it requires too much hardware to implement. This paper examines the feasibility of data dependent circuit for subgraph isomorphism problem. Logic gates are generally reducible if...
متن کاملSequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k trees and k connected partial k trees these include subgraph isomorphism and topological embedding known to be NP complete for general partial k trees As well as contributing to our understanding of the types of graphs for which these problems are tractable this paper introduces new methods ...
متن کامل